Is perceptual space inherently non-Euclidean?
نویسندگان
چکیده
منابع مشابه
Is perceptual space inherently non-Euclidean?
It is often assumed that the space we perceive is Euclidean, although this idea has been challenged by many authors. Here we show that, if spatial cues are combined as described by Maximum Likelihood Estimation, Bayesian, or equivalent models, as appears to be the case, then Euclidean geometry cannot describe our perceptual experience. Rather, our perceptual spatial structure would be better de...
متن کاملNon-euclidean structure of spectral color space
Color processing methods can be divided into methods based on human color vision and spectral based methods. Human vision based methods usually describe color with three parameters which are easy to interpret since they model familiar color perception processes. They share however the limitations of human color vision such as metamerism. Spectral based methods describe colors by their underlyin...
متن کاملOn the Quaternionic Curves in the Semi-Euclidean Space E_4_2
In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.
متن کاملThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملSubvoxel Accurate Graph Search Using Non-Euclidean Graph Space
Graph search is attractive for the quantitative analysis of volumetric medical images, and especially for layered tissues, because it allows globally optimal solutions in low-order polynomial time. However, because nodes of graphs typically encode evenly distributed voxels of the volume with arcs connecting orthogonally sampled voxels in Euclidean space, segmentation cannot achieve greater prec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Psychology
سال: 2009
ISSN: 0022-2496
DOI: 10.1016/j.jmp.2008.12.006